Discussion of One Improved Hash Algorithm Based on MD 5 and SHA 11

نویسنده

  • Guangzhong Liu
چکیده

We have devised one 160 bits improved hash algorithm based on MD5 and SHA1. And in additional, we also introduce four assistant functions named:F(X,Y,Z), G(X,Y,Z), H(X,Y,Z), and I(X,Y,Z) to do 4 rounds of 16 steps iterative operation with 32-bit data as input and 32-bit as output, saving in A, B, C, D respectively. Then we use one new extending function K(X,Y,Z) to expand 32-bit A, B, C, D to 40-bit. At last, by combining the result from low-bit AA, we realize the 160-bit hash algorithm. By analysis, we have found that: without increasing the time complexity, the improved algorithm has increased the security better compared with MD5 and SHA1 algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Portable Implementation of the Secure Hash Algorithm

In 1992, NIST announced a proposed standard for a collision-free hash function. The algorithm for producing the hash value is known as the Secure Hash Algorithm (SHA), and the standard using the algorithm in known as the Secure Hash Standard (SHS). Later, an announcement was made that a scientist at NSA had discovered a weakness in the original algorithm. A revision to this standard was then an...

متن کامل

A Fast Portable Implementation of the Secure Hash Algorithm , III ∗ †

In 1992, NIST announced a proposed standard for a collision-free hash function. The algorithm for producing the hash value is known as the Secure Hash Algorithm (SHA), and the standard using the algorithm in known as the Secure Hash Standard (SHS). Later, an announcement was made that a scientist at NSA had discovered a weakness in the original algorithm. A revision to this standard was then an...

متن کامل

An Improved Hash Function Based on the Tillich-Zémor Hash Function

Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.

متن کامل

The Compression Functions of SHA , MD 2 , MD 4 and MD 5 are not A ne

In this paper, we show that the compressions functions of SHA, MD2, MD4 and MD5 are not a ne transformations of their inputs.

متن کامل

Cayley Hashes: A Class of Efficient Graph-based Hash Functions

Hash functions are widely used in cryptography. Recent breakthroughs against the standard SHA-1 prompted NIST to launch a competition for a new secure hash algorithm, SHA-3 [1]. Provably secure hash functions, that is functions whose security reduces to a simply-stated, supposedly hard mathematical problem, are widely believed to be much too slow for the NIST competition. In this paper, we disc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007